Higher integrality conditions, volumes and Ehrhart polynomials
نویسندگان
چکیده
A polytope is integral if all of its vertices are lattice points. The constant term of the Ehrhart polynomial of an integral polytope is known to be 1. In previous work, we showed that the coefficients of the Ehrhart polynomial of a lattice-face polytope are volumes of projections of the polytope. We generalize both results by introducing a notion of k-integral polytopes, where 0-integral is equivalent to integral. We show that the Ehrhart polynomial of a k-integral polytope P has the properties that the coefficients in degrees less than or equal to k are determined by a projection of P , and the coefficients in higher degrees are determined by slices of P . A key step of the proof is that under certain generality conditions, the volume of a polytope is equal to the sum of volumes of slices of the polytope. © 2010 Elsevier Inc. All rights reserved. MSC: primary 52B20; secondary 52A38, 05A15
منابع مشابه
1 Residues formulae for volumes and Ehrhart polynomials of convex polytopes . Welleda Baldoni - Silva and Michèle Vergne January 2001
These notes on volumes and Ehrhart polynomials of convex polytopes are afterwards thoughts on lectures already delivered in Roma, by the second author in December 1999. The subject of these lectures was to explain Jeffrey-Kirwan residue formula for volumes of convex polytopes [J-K] and the residue formula for Ehrhart polynomials of rational polytopes [B-V 1, 2]. The main concept used in these f...
متن کاملEhrhart Polynomials of Integral Simplices with Prime Volumes
For an integral convex polytope P ⊂ R of dimension d, we call δ(P) = (δ0, δ1, . . . , δd) the δ-vector of P and vol(P) = ∑d i=0 δi its normalized volume. In this paper, we will establish the new equalities and inequalities on δ-vectors for integral simplices whose normalized volumes are prime. Moreover, by using those, we will classify all the possible δ-vectors of integral simplices with norma...
متن کاملEhrhart polynomials of convex polytopes with small volumes
Let P ⊂ R be an integral convex polytope of dimension d and δ(P) = (δ0, δ1, . . . , δd) be its δ-vector. By using the known inequalities on δ-vectors, we classify the possible δ-vectors of convex polytopes of dimension d with P
متن کاملEhrhart Clutters: Regularity and Max-Flow Min-Cut
If C is a clutter with n vertices and q edges whose clutter matrix has column vectorsA = {v1, . . . , vq}, we call C an Ehrhart clutter if {(v1, 1), . . . , (vq, 1)} ⊂ {0, 1} n+1 is a Hilbert basis. Letting A(P ) be the Ehrhart ring of P = conv(A), we are able to show that if C is a uniform unmixed MFMC clutter, then C is an Ehrhart clutter and in this case we provide sharp upper bounds on the ...
متن کاملClutters : Regularity and Max - Flow Min - Cut
If C is a clutter with n vertices and q edges whose clutter matrix has column vectors A = {v1, . . . , vq}, we call C an Ehrhart clutter if {(v1, 1), . . . , (vq , 1)} ⊂ {0, 1} n+1 is a Hilbert basis. Letting A(P ) be the Ehrhart ring of P = conv(A), we are able to show that if A is the clutter matrix of a uniform, unmixed MFMC clutter C, then C is an Ehrhart clutter and in this case we provide...
متن کامل